Abstractions for Devising Byzantine-Resilient State Machine Replication
نویسندگان
چکیده
State machine replication is a common approach for making a distributed service highly available and resilient to failures, by replicating it on different processes. It is well-known, however, that the difficulty of ensuring the safety and liveness of a replicated service increases significantly when no synchrony assumptions are made, and when processes can exhibit Byzantine behaviors. The contribution of this work is to break the complexity of devising a Byzantine-resilient state machine replication protocol, by decomposing it into key modular abstractions. In addition to being modular, the protocol we propose always preserves safety in presence of less than one third of Byzantine processes, independently of any synchrony assumptions. As for the liveness of our protocol, it relies on a Byzantine failure detector that encapsulates the sufficient amount of synchrony. • Submission Categories: fault-tolerant systems, secure systems, distributed algorithms. •
منابع مشابه
The State Machine Approach: A Tutorial
The state machine approach is a general method for achieving fault tolerance and implementing decentralized control in distributed systems. This paper reviews the approach and identifies abstractions needed for coordinating ensembles of state machines. Implementations of these abstractions for two different failure models Byzantine and fail-stolr--are discussed. The state machine approach is il...
متن کاملAn Attack-Resilient Architecture for Large-Scale Intrusion-Tolerant Replication
This paper presents the first architecture for large-scale, wide-area intrusion-tolerant state machine replication that is specifically designed to perform well even when some of the servers are Byzantine. The architecture is hierarchical and runs attack-resilient state machine replication protocols within and among the wide-area sites. Given the constraints of the wide-area environment, we exp...
متن کاملAbstracting out Byzantine Behavior
ing out Byzantine Behavior Peter Druschel, Andreas Haeberlen, Petr Kouznetsov Max Planck Institute for Software Systems MPI-SWS, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany {druschel,ahae,pkouznet}@mpi-sws.mpg.de Abstract. Many distributed systems are designed to tolerate the presence of Byzantine failures: an individual process may arbitrarily deviate Many distributed systems are designe...
متن کاملPractical Byzantine Fault Tolerance Using Fewer than 3f+1 Active Replicas
Byzantine fault tolerant state machine replication (BFT-SMR) is a foundation for implementations of highly reliable services. Existing algorithms for BFT-SMR require at least 3f +1 active replicas to tolerate f faulty replicas. We show that BFT-SMR can be achieved with fewer than 3f +1 active replicas, as long as standby spare replicas are available, such that the number of active replicas plus...
متن کاملPartial Replication in the Database State Machine
This paper investigates the use of partial replication in the Database State Machine approach introduced earlier for fully replicated databases. It builds on the order and atomicity properties of group communication primitives to achieve strong consistency and proposes two new abstractions: Resilient Atomic Commit and Fast Atomic Broadcast. Even with atomic broadcast, partial replication requir...
متن کامل